iteration [iterative] algorithm

iteration [iterative] algorithm
итерационный алгоритм

The English-Russian dictionary on reliability and quality control. 2015.

Игры ⚽ Поможем написать курсовую

Смотреть что такое "iteration [iterative] algorithm" в других словарях:

  • Iterative proportional fitting — The iterative proportional fitting procedure (IPFP, also known as biproportional fitting in statistics, RAS algorithm[1] in economics and matrix raking or matrix scaling in computer science) is an iterative algorithm for estimating cell values of …   Wikipedia

  • Iterative Closest Point — (ICP) is an algorithm employed to match two clouds of points. This matching is used to reconstruct 3D surfaces from different scans, to localize robots and achieve optimal path planning (especially when wheel odometry is unreliable due to… …   Wikipedia

  • Iterative Viterbi decoding — is an algorithm that spots the subsequence S of an observation O = { o 1, ..., o n } having the highest average probability (i.e., probability scaled by the length of S ) of being generated by a given hidden Markov model M with m states. The… …   Wikipedia

  • Iterative deepening depth-first search — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …   Wikipedia

  • Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

  • Iterative Closest Point — L Iterative Closest Point (ICP) est un algorithme utilisé pour minimiser les différences entre deux nuages de points. L ICP est souvent utilisée pour reconstruire des surfaces/modèles 2D ou 3D à partir des différents balayages, de localiser et de …   Wikipédia en Français

  • Eigenvalue algorithm — In linear algebra, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors. Contents 1 Characteristic polynomial 2 Power… …   Wikipedia

  • Lanczos algorithm — The Lanczos algorithm is an iterative algorithm invented by Cornelius Lanczos that is an adaptation of power methods to find eigenvalues and eigenvectors of a square matrix or the singular value decomposition of a rectangular matrix. It is… …   Wikipedia

  • Liu Hui's π algorithm — is a mathematical algorithm invented by Liu Hui (fl. 3rd century), a mathematician of Wei Kingdom. Before his time, the ratio of the circumference of a circle to diameter was often taken experimentally as 3 in China, while Zhang Heng (78… …   Wikipedia

  • Cascade algorithm — The cascade algorithm is a numerical method for calculating the basic scaling function or wavelets using an iterative algorithm, which computes wavelet coefficients at one scale from those at another. Because it applies the same operation over… …   Wikipedia

  • Arnoldi iteration — In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of iterative methods. Arnoldi finds the eigenvalues of general (possibly non Hermitian) matrices; an analogous method for Hermitian matrices is …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»